Performance Analysis of Cache Replacement Algorithm using Virtual Named Data Network Nodes

As a future internet candidate, named Data Network (NDN) provides more efficient communication than TCP/IP network. Unlike TCP/IP, consumer requests in NDN are sent based on content, not the address. The previous study evaluated performance using simulator. In this research, we modeled system virtual nodes, making model relevant to real NDN. an essential component every router, content store (CS) has function keep data. We use First Out (FIFO) and Least Recetly Used (LRU) our nodes as cache replacement algorithms. in-depth exploration is done various scenarios. result shows that hit ratio (CHR) increases if size of CS, number interests, consumers increases. CHR decreases producers prefixes increase. increases, round trip time (RTT) decreases. LRU better for all cases: higher 5-15% lower RTT 1-10% FIFO.